The Graver Complexity of Integer Programming
نویسندگان
چکیده
Yael Berstein Shmuel Onn Abstract In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver complexity of the incidence matrix of the complete bipartite graph K3,m satisfies g(m) = Ω(2 ), with g(m) ≥ 17 ·2−7 for every m > 3 . keywords: Graver basis, Gröbner basis, Graver complexity, Markov complexity, contingency table, transportation polytope, transportation problem, integer programming, computational complexity. AMS Subject Classification: 05A, 15A, 51M, 52A, 52B, 52C, 62H, 68Q, 68R, 68U, 68W, 90B, 90C
منابع مشابه
Robust integer programming
We provide a complexity classification of four variants of robust integer programming when the underlying Graver basis is given. We discuss applications to robust multicommodity flows and multidimensional transportation, and describe an effective parametrization of robust integer programming.
متن کاملConvex integer maximization via Graver bases
We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on R and w1x, . . . , wdx are linear forms on R, max {c(w1x, . . . , wdx) : Ax = b, x ∈ N} . This method works for arbitrary input data A, b, d, w1, . . . , wd, c. Moreover, for fixed d and several important classes of programs in variable dimension, we...
متن کاملThe Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions
It has been shown in a number of recent papers that Graver bases methods enable to solve linear and nonlinear integer programming problems in variable dimension in polynomial time, resulting in a variety of applications in operations research and statistics. In this article we continue this line of investigation and show that Graver bases also enable tominimize quadratic and higher degree polyn...
متن کاملN-Fold Integer Programming
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time solvable. Our proof involves two heavy ingredients discovered recently: the equivalence of linear optimization and so-called directed augmentation, and the stabilization of certain Graver bases. We discuss several appl...
متن کاملHuge Multiway Table Problems
Optimization over l×m× n integer threeway tables is NP-hard already for fixed l = 3, but solvable in polynomial time with both l,m fixed. Here we consider huge tables, where the variable dimension n is encoded in binary. Combining recent results on Graver bases and recent results on integer cones, we show how to handle such problems in polynomial time. We also show that a harder variant of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0709.1500 شماره
صفحات -
تاریخ انتشار 2007